Cryptanalysis of Ciphers Based on AES Structure
نویسندگان
چکیده
AES is the best known and most widely used block cipher. Its three versions (AES-128, AES-192, and AES-256) differ in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). Our present work investigates the recently reported attacks on AES 256 and AES 192. Instead of concentrating on the actual algorithms of these attacks we shall be more interested in the question, what makes AES 256 so vulnerable to these related key attacks which are all based on a common concept. Additionally we seek an informal answer to the very relevant query that how much vulnerable is the most used variant of AES, namely AES 128, against these kind of cryptanalysis. Next we try to use the related key based cryptanalytic techniques on some other cipher. For this purpose we choose a stream cipher based on the AES structure. In [4], Biryukov presented a new methodology of stream cipher design, called Leak Extraction. The stream cipher LEX, based on this methodology and on the AES block cipher, was selected to phase 3 of the eSTREAM competition. The suggested methodology seemed promising, and LEX, due to its elegance, simplicity and performance was expected to be selected to the eSTREAM portfolio. However [10] suggests a key recovery attack on LEX. The attack requires about 2 bytes of key-stream produced by the same key (possibly under many different IVs), and retrieves the secret key in time of 2 simple operations. In this work we explored LEX further and have shown that under the assumption that we get hold of key streams generated by two related keys and four specially engineered IVs we can predict the bytes of the keystream generated by LEX with probability 1 in time of approximately 2 operations. We have extended this observation to derive some secret intermediate state bytes of LEX in a related key based attack model. Then we suggest an improvement in the design of LEX. We show that this improved version of LEX is protected against all existing attacks. Lastly we have used the methodology of Leak Extraction on another AES finalist SERPENT. This creates LESERP, a new stream cipher.
منابع مشابه
Impossible Differential Cryptanalysis on Reduced round of Tiny Aes
---------------------------------------------------------------------***--------------------------------------------------------------------Abstract The emerging need of the secure ciphers has lead to the designing and analysis of many lightweight block ciphers. In this respect, many lightweight block ciphers have been designed, of which is simple AES, one of the popular proposed secure block c...
متن کاملNovel Impossible Differential Cryptanalysis of Zorro Block Cipher
Impossible difference attack is a powerful tool for evaluating the security of block ciphers based on finding a differential characteristic with the probability of exactly zero. The linear layer diffusion rate of a cipher plays a fundamental role in the security of the algorithm against the impossible difference attack. In this paper, we show an efficient method, which is independent of the qua...
متن کاملStructural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128
While the symmetric-key cryptography community has now a good experience on how to build a secure and efficient fixed permutation, it remains an open problem how to design a key-schedule for block ciphers, as shown by the numerous candidates broken in the related-key model or in a hash function setting. Provable security against differential and linear cryptanalysis in the related-key scenario ...
متن کاملImproving Immunity of Feistel Ciphers against Differential Cryptanalysis by Using Multiple MDS Matrices
A practical measure to estimate the immunity of block ciphers against differential and linear attacks consists of finding the minimum number of active S-Boxes, or a lower bound for this minimum number. The evaluation result of lower bounds of differentially active S-boxes of AES, Camellia (without FL/FL−1) and Feistel ciphers with an MDS based matrix of branch number 9, showed that the percenta...
متن کاملThe Inverse S-Box, Non-linear Polynomial Relations and Cryptanalysis of Block Ciphers
This paper is motivated by the design of AES. We consider a broader question of cryptanalysis of block ciphers having very good non-linearity and diffusion. Can we expect anyway, to attacks such ciphers, clearly designed to render hopeless the main classical attacks ? Recently a lot of attention have been drawn to the existence of multivariate algebraic relations for AES (and other) S-boxes. Th...
متن کاملAlgebraic cryptanalysis of block ciphers using Groebner bases
This thesis investigates the application of Gröbner bases to cryptanalysis of block ciphers. The basic for the application is an algorithm for solving systems of polynomial equations via Gröbner basis computation. In our case, polynomial equations describe the key recovery problem for block ciphers, i.e., the solution of these systems corresponds to the value of the secret key. First we demonst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010